Transformation Of Natural Language Into Logical Formulas

نویسندگان

  • Leonard Bolc
  • Tomek Strzalkowski
چکیده

This paper presents an attempt of elaborat ion of a f u l l parsing system for Polish natural language which is being worked out in the Ins t l t~ te of Informatics of Warsaw Univers i ty . Our system was adapted to the parsing of the corpus of real medical texts whici= concern a subdomain of medicine. We made use of the experience of such famous authors as (6), (7), (8), (9), (10), (11), (12), (13), (1~).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Knowledge Representation Systems with First-Order Formulas as Atoms

This paper proposes a knowledge representation system by extension of the concept of atom. Not only conventional simple atoms, but also atoms representing first-order formulas, which are called formula atoms, are used. By this extension, predicates, logical connectives, and quantifiers may occur in atoms, and can be regarded as objects in the same class, allowing more natural translation from n...

متن کامل

Logical vs. Natural Language Conjunctions in Czech: A Comparative Study

This paper studies the relationship between conjunctions in a natural language (Czech) and their logical counterparts. It shows that the process of transformation of a natural language expression into its logical representation is not straightforward. The paper concentrates on the most frequently used logical conjunctions, ∧ and ∨, and it analyzes the natural language phenomena which influence ...

متن کامل

Using Natural Language Dialog System DST for Discovery of Logical Constructions of Children's Speech

Logical constructions in speech of 4-6 years old children are investigated by using the dialog system DST for transformation of the natural language texts. The research has brought up the point, that children are able to operate both on the first-level (predicate) calculus, and higher-level predicate calculus – that means formulas creation. It is remarkable how the constructs of making conclusi...

متن کامل

The Naproche System

The Naproche project (Natural language Proof Checking) was initiated by Bernhard Schröder and Peter Koepke at the University of Bonn to focus on an interdisciplinary study of the semi-formal language of mathematics. A central goal of Naproche is to develop a controlled natural language (CNL) for mathematical texts and adapted proof checking software which checks texts written in the CNL for syn...

متن کامل

Logical types and linguistic types

One of the primary aims of linguistic semantics is to translate the expressions of natural language into formulas of some logical calculus. These formulas, in turn, can be interpreted in the appropriate models, and semantic notions like truth, entailment, etc. can be formally defined in the usual manner. In addition to the well-known theoretical advantages of such an intermediate logical form, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1982